Stationary distributions and convergence for M/M/1 queues in interactive random environment
نویسندگان
چکیده
منابع مشابه
Heavy-traffic limits for nearly deterministic queues: stationary distributions
We establish heavy-traffic limits for stationary waiting times and other performance measures in Gn/Gn/1 queues, where Gn indicates that an original point process is modified by cyclic thinning of order n; i.e., the thinned process contains every n point from the original point process. The classical example is the Erlang En/En/1 queue, where cyclic thinning of order n is applied to both the in...
متن کاملStationary Measures for Random Walks in aRandom Environment with Random
Let ? act on a countable set V with only nitely many orbits. Given a ?-invariant random environment for a Markov chain on V and a random scenery, we exhibit, under certain conditions, an equivalent stationary measure for the environment and scenery from the viewpoint of the random walker. Such theorems have been very useful in investigations of percolation on quasi-transitive graphs.
متن کاملExistence of stationary distributions for a class of nonlinear time series models in random environment domain
* Correspondence: [email protected] School of Mathematics and Computational Science, Changsha University of Science and Technology, 410076 Hunan, China Full list of author information is available at the end of the article Abstract In this paper, we study the problem of a variety of nonlinear time series model Xn+1 = F(Xn, en+1(Zn+1)) in which {Zn+1} is a Markov chain with finite state space, a...
متن کاملA Characterization of Product-form Stationary Distributions for Queueing Systems in Random Environment
We consider continuous-time Markov chains representing queueing systems in random environment and we obtain necessary and sufficient conditions for having product-form stationary distributions. The related topics of partial balance and the ESTA property are also studied. As an illustration, we apply the results to study the stationary distributions of Jackson networks in random environment. For...
متن کامل3 Stationary Distributions of Random Walks
In today’s lecture, we consider a random walk on an undirected graph. One way to think about a random walk is to imagine somebody walking through a city with no particular goal in mind. At each intersection, he or she chooses a random street to take next. We ask the questions: How long until this person reaches a particular point? How long until he/she has been to every intersection or every st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queueing Systems
سال: 2020
ISSN: 0257-0130,1572-9443
DOI: 10.1007/s11134-019-09644-9